(Non-)Random Sequences from (Non-)Random Permutations—Analysis of RC4 Stream Cipher
نویسندگان
چکیده
منابع مشابه
Non-uniformities in the RC4 Stream Cipher
The RC4 stream cipher is used to protect messages from eavesdroppers in many settings, including some of the Transport Layer Security (TLS) protocols used to secure much internet traffic. Nonuniformities in the output of a stream cipher are a weakness that an eavesdropper can exploit to gain information about the encrypted messages. In this report we verify the size of some nonuniformities of R...
متن کاملAttacks on the RC4 stream cipher
In this article we present some weaknesses in the RC4 cipher and their cryptographic applications. Especially we improve the attack described in [2] in such a way, that it will work, if the weak keys described in that paper are avoided. A further attack will work even if the first 256 Byte of the output remain unused. Finally we show that variants of the RC4 algorithm like NGG and RC4A are also...
متن کاملA New Variant of RC4 Stream Cipher
RC4 was used as an encryption algorithm in WEP(Wired Equivalent Privacy) protocol that is a standardized for 802.11 wireless network. A few attacks followed, indicating certain weakness in the design. In this paper, we proposed a new variant of RC4 stream cipher. The new version of the cipher does not only appear to be more secure, but its keystream also has large period, large complexity and g...
متن کاملL-P States of RC4 Stream Cipher
The stream cipher RC4 was designed by R.Rivest in 1987, and it is a widely deployed cipher. Many predictive states of RC4 for some special indices i were presented in the last 20 years. In this paper, we present several long term predictive states. These states increase the probability to guess part of the internal state in a known plaintext attack and present a cryptanalytic weakness of RC4. T...
متن کاملKey Collisions of the RC4 Stream Cipher
This paper studies “colliding keys” of RC4 that create the same initial state and hence generate the same pseudo-random byte stream. It is easy to see that RC4 has colliding keys when its key size is very large, but it was unknown whether such key collisions exist for shorter key sizes. We present a new state transition sequence of the key scheduling algorithm for a related key pair of an arbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2012
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-012-9138-1